Characterizing Programming Systems Allowing Program Self-Reference
نویسندگان
چکیده
منابع مشابه
Characterizing Self-Healing Software Systems
The introduction of self-healing capabilities to software systems could offer a way to alter the current, unfavorable imbalance in the software security arms race. Consequently, self-healing software systems have emerged as a research area of particular interest in recent years. Motivated by the inability of traditional techniques to guarantee software integrity and availability, especially aga...
متن کاملUnderstanding and Characterizing Program Visualization Systems
The general term program visualization refers to graphical views or illustrations of the entities and characteristics of computer programs. This term along with many others including data structure display, program animation, algorithm animation, etc., have been used inconsistently in the literature, which has led to confusion in describing systems providing these capabilities. In this paper we...
متن کاملProgramming Unconventional Computers: Dynamics, Development, Self-Reference
Classical computing has well-established formalisms for specifying, refining, composing, proving, and otherwise reasoning about computations. These formalisms have matured over the past 70 years or so. Unconventional Computing includes the use of novel kinds of substrates–from black holes and quantum effects, through to chemicals, biomolecules, even slime moulds–to perform computations that do ...
متن کاملProperties Complementary to Program Self-reference
In computability theory, program self-reference is formalized by the not-necessarily-constructive form of Kleene’s Recursion Theorem (krt). In a programming system in which krt holds, for any preassigned, algorithmic task, there exists a program that, in a sense, creates a copy of itself, and then performs that task on the self-copy. Herein, properties complementary to krt are considered. Of pa...
متن کاملSelf-Reference Ultra-Wideband Systems
In practical Ultra-Wideband (UWB) systems, Rake receivers are not able to fully take advantage of all resolvable paths, because of the required computational and power resources. On the other hand, Transmitted Reference (TR) schemes are simple, robust structures with low power consumption and they do not require channel estimation, but they sustain a 3dB energy/rate loss, as each symbol require...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2009
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-009-9168-8